Classifying material implications over minimal logic
نویسندگان
چکیده
منابع مشابه
Dynamic Topological Logic Interpreted over Minimal Systems
Dynamic Topological Logic (DT L) is a modal logic which combines spatial and temporal modalities for reasoning about dynamic topological systems, which are pairs consisting of a topological space X and a continuous function f : X → X. The function f is seen as a change in one unit of time; within DT L one can model the long-term behavior of such systems as f is iterated. One class of dynamic to...
متن کاملInterpolation and Beth Definability over the Minimal Logic
Extensions of the Johansson minimal logic J are investigated. It is proved that the weak interpolation property WIP is decidable over J. Well-composed logics with the Graig interpolation property CIP, restricted interpolation property IPR and projective Beth property PBP are fully described. It is proved that there are only finitely many well-composed logics with CIP, IPR or PBP; for any well-c...
متن کاملComputing Minimal Generators from Implications: a Logic-guided Approach
Sets of attribute implications may have a certain degree of redundancy and the notion of basis appears as a way to characterize the implication set with less redundancy. The most widely accepted is the Duquenne-Guigues basis, strongly based on the notion of pseudo-intents. In this work we propose the minimal generators as an element to remove redundancy in the basis. The main problem is to enum...
متن کاملMinimal Logic Re-synthesis
Most problems in logic synthesis are computationallyhard, and are solved using heuristics. This often makes algorithms un-stable; if the input is changed slightly, the new result of synthesis can be significantly different. A designer can spend much effort hand-optimizing a circuit, so it is desirable to retain as much of this human insight as possible. This motivates the need for incremental s...
متن کاملMinimal Logic Programs
bb We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a method consisting in the generation of the set of prime implicates of the original theory, starting from its set of countermodels (in the logic of Here-and-There), in a similar vein to the Quine-McCluskey method for minim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2020
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-020-00722-x